On the Debate Concerning Evolutionary Search Using Prüfer Numbers

Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search

The most important element in the design of a decoder-based evolutionary algorithm is its genotypic representation. The genotypedecoder pair must exhibit efficiency, locality, and heritability to enable effective evolutionary search. Prüfer numbers have been proposed to represent spanning trees in evolutionary algorithms. Several researchers have made extravagant claims for the usefulness of th...

Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search

Using composite ranking to select the most appropriate Multi-Criteria Decision Making (MCDM) method in the optimal operation of the Dam reservoir

In this study, the performance of the algorithms of whale, Differential evolutionary, crow search, and Gray Wolf optimization were evaluated to operate the Golestan Dam reservoir with the objective function of meeting downstream water needs. Also, after defining the objective function and its constraints, the convergence degree of the algorithms was compared with each other and with the absolut...

Developing New Locality Results for the Prüfer Code using a Remarkable Linear-Time Decoding Algorithm

The Prüfer Code is a bijection between the nn−2 trees on the vertex set [1, n] and the nn−2 strings in the set [1, n]n−2 (known as Prüfer strings of order n). Efficient linear-time algorithms for decoding (i.e., converting string to tree) and encoding (i.e., converting tree to string) are well-known. In this paper, we examine an improved decoding algorithm (due to Cho et al.) that scans the ele...

Shuffled Frog-Leaping Programming for Solving Regression Problems

There are various automatic programming models inspired by evolutionary computation techniques. Due to the importance of devising an automatic mechanism to explore the complicated search space of mathematical problems where numerical methods fails, evolutionary computations are widely studied and applied to solve real world problems. One of the famous algorithm in optimization problem is shuffl...